Cooperative and Cognitive Communication in Wireless Networks

نویسنده

  • Liping Wang
چکیده

In the last decade, significant efforts and progress have been made by both the industry and academia to meet the rapidly growing demand for wireless applications and services. To achieve more flexible, dynamic and intelligent use of the limited wireless spectrum, cooperative transmission and cognitive networking are proposed as two of the key technologies for the next generation wireless communication systems, such as Long-Term Evolution Advanced. Cooperative transmission techniques, such as cooperative relaying and Multiple-Input and Multiple-Output (MIMO) can increase spectrum efficiency by utilizing the diversity of wireless channels, while cognitive transmitters tune their transmission parameters according to the environment to optimize network level performance. In this thesis, we provide performance modeling and analysis of different cooperative and cognitive communication techniques to exploit their potential. In the first part of the thesis, we investigate the performance of hop-by-hop cooperative communication on a multihop transmission path applying spatial reuse time division multiplexing, where interference from simultaneous transmissions exists. Based on the models, we compare the performance of hop-by-hop cooperation with the performance of traditional simple multihopping schemes, and give the regimes where hop-by-hop cooperation achieves significant gain. Considering random networks, we propose cooperative geographic routing, the integration of hop-by-hop cooperation with traditional geographic routing, and evaluate the effects of the topology knowledge range and the network density. In the second part of the thesis, we discuss how cooperative transmission techniques can be utilized in cognitive and hierarchical spectrum sharing networks, where the primary users have transmission guarantees, and the coexisting secondary users need to be cognitive and adjust their transmissions in the shared spectrum bands to conform constraints from the primary users. We consider large-scale coexisting primary and secondary networks, where concurrent primary and secondary transmissions are allowed, and the secondary users provide cooperative relaying for the primary ones and control the interference at the primary receivers by tuning the probability of transmitting and by forming a primary exclusive region around each primary receiver within which all secondary users have to be silent. We define a unified analytic framework to model the performance of cooperative spectrum sharing and cognitive transmission control, characterize their achievable gains, and show that both of the networks have strong incentives to participate in the collaboration. Finally, we investigate spectrum sharing networks where both primary and secondary users have stochastic packet arrival. Under the constraint that the performance of primary users does not degrade, we find the dilemma for the secondary users. That is, if a secondary user chooses to cooperate, it can transmit immediately even if the primary queue is not empty, but has additional costs for relaying primary packets, such as increased power consumption. We propose a dynamic cooperation scheme for the secondary user so that it can make sequential decision on whether to cooperate or not in each time slot based on the state of the network. We show that optimal sequential decision is necessary to efficiently trade off the cooperation cost and the packet delay of the secondary user.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Performance Analysis of Wireless Cooperative Networks with Iterative Incremental Relay Selection

In this paper, an iterative incremental relay selection (IIRS) scheme is considered for wireless cooperative networks in order to increase the reliability of transmission. Different from the conventional incremental relay selection which incrementally selects a best relay for only one iteration; the IIRS scheme iteratively applies the incremental relaying and relay selection processes. To evalu...

متن کامل

Sum-Rate Maximization Based on Power Constraints for Cooperative AF Relay Networks

In this paper, our objective is maximizing total sum-rate subject to power constraints on total relay transmit power or individual relay powers, for amplify-and-forward single-antenna relay-based wireless communication networks. We derive a closed-form solution for the total power constraint optimization problem and show that the individual relay power constraints optimization problem is a quad...

متن کامل

Spectrum Sensing Data Falsification Attack in Cognitive Radio Networks: An Analytical Model for Evaluation and Mitigation of Performance Degradation

Cognitive Radio (CR) networks enable dynamic spectrum access and can significantly improve spectral efficiency. Cooperative Spectrum Sensing (CSS) exploits the spatial diversity between CR users to increase sensing accuracy. However, in a realistic scenario, the trustworthy of CSS is vulnerable to Spectrum Sensing Data Falsification (SSDF) attack. In an SSDF attack, some malicious CR users deli...

متن کامل

Attack-Aware Cooperative Spectrum Sensing in Cognitive Radio Networks under Byzantine Attack

Cooperative Spectrum Sensing (CSS) is an effective approach to overcome the impact of multi-path fading and shadowing issues. The reliability of CSS can be severely degraded under Byzantine attack, which may be caused by either malfunctioning sensing terminals or malicious nodes. Almost, the previous studies have not analyzed and considered the attack in their models. The present study introduc...

متن کامل

Distributed and Cooperative Compressive Sensing Recovery Algorithm for Wireless Sensor Networks with Bi-directional Incremental Topology

Recently, the problem of compressive sensing (CS) has attracted lots of attention in the area of signal processing. So, much of the research in this field is being carried out in this issue. One of the applications where CS could be used is wireless sensor networks (WSNs). The structure of WSNs consists of many low power wireless sensors. This requires that any improved algorithm for this appli...

متن کامل

Quasi Random Deployment Strategy for Reliable Communication Backbones in Wireless Sensor Networks

Topology construction and topology maintenance are significant sub-problems of topology control. Spanning tree based algorithms for topology control are basically transmission range based type construction algorithms. The construction of an effective backbone, however, is indirectly related to the placement of nodes. Also, the dependence of network reliability on the communication path undertak...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013